Efficient variant of Rainbow using sparse secret keys
نویسندگان
چکیده
Multivariate Public Key Cryptosystems (MPKC) is one of candidates for post-quantum cryptography. Rainbow is an MPKC digital signature scheme, with relatively efficient encryption and decryption processes. However, the size of the secret key of Rainbow is substantially larger than that of an RSA cryptosystem for the same security level. By using sparse secret keys, the size of the secret key of Rainbow can be reduced. In addition, a method using sparse secret keys can accelerate the signature generation of Rainbow. Matrix-based Rainbow and NT-Rainbow, which we previously proposed, are variants of Rainbow using sparse secret keys. These two variants of Rainbow reduce the size of the secret key of Rainbow, and improve the efficiency of the signature generation of Rainbow. In this paper, we combine these two variants of Rainbow. As a consequence, the combined scheme realizes even smaller size of the secret key and even more efficient signature generation than those of the two variants of Rainbow. In particular, in comparison with the original Rainbow, the secret key is reduced in size by about 76% and the signature generation is sped up by about 55% at the security level of 100 bits.
منابع مشابه
Quo Vadis Quaternion? Cryptanalysis of Rainbow over Non-commutative Rings
The Rainbow Signature Scheme is a non-trivial generalization of the well known Unbalanced Oil and Vinegar Signature Scheme (Eurocrypt '99) minimizing the length of the signatures. Recently a new variant based on non-commutative rings, called NC-Rainbow, was introduced at CT-RSA 2012 to further minimize the secret key size. We disprove the claim that NC-Rainbow is as secure as Rainbow in general...
متن کاملJoint optimisation of secret key capacity and sparse channel estimation based on pilot power allocation
ELECT Pilot power allocation is investigated under the framework of physical layer secure communications in time-division duplex systems, where the secret keys are generated from the estimates of sparse wireless channels. The joint optimisation of secret key capacity and sparse channel estimation performance based on pilot power allocation is formulated as a convex optimisation problem. Conside...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملOn the Security of Two Key-Updating Signature Schemes
In ICICS 2004, Gonzalez-Deleito, Markowitch and Dall’Olio proposed an efficient strong key-insulated signature scheme. They claimed that it is (N−1, N)-key-insulated, i.e., the compromise of the secret keys for arbitrarily many time periods does not expose the secret keys for any of the remaining time periods. But in this paper, we demonstrate an attack and show that an adversary armed with the...
متن کاملEfficient fully homomorphic encryption with circularly secure key switching process
Fully homomorphic encryption (FHE) has important applications in cloud computing. However, almost all fully homomorphic encryption schemes share two common flaws that they all use large-scale secret keys and some operations inefficient. In this paper, the “special b” variant of the Learning With Errors problem (bLWE) is presented, and helps us construct the first circularly secure key switching...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JoWUA
دوره 5 شماره
صفحات -
تاریخ انتشار 2014